Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
نویسندگان
چکیده
منابع مشابه
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use ofhigher-order stacks, that is, a nested “stack of stacks” structure. These systems may be usedto model higher-order programs and are closely related to the Caucal hierarchy of infinitegraphs and safe higher-order recursion schemes.We consider the backwards-reachability problem over higher-order Alt...
متن کاملN ov 2 00 8 SYMBOLIC BACKWARDS - REACHABILITY ANALYSIS FOR HIGHER - ORDER PUSHDOWN SYSTEMS
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested " stack of stacks " structure. These systems may be used to model higher-order programs and are closely related to the Caucal hierarchy of infinite graphs and safe higher-order recursion schemes. We consider the backwards-reachability problem over higher-order Alternating P...
متن کاملAn Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre ∗ H(C), is regular. In this paper, we give an alternative proof of this result for second order automata. Our construction of automata for recognizing pre∗H(C) is explicit. The termination of saturation procedure used is obvious. It gives a better bound on size of the...
متن کاملReachability Analysis of First-order Definable Pushdown Systems
We study pushdown systems where control states, stack alphabet, and transition relation, instead of being finite, are first-order definable in a fixed countably-infinite structure. We show that the reachability analysis can be addressed with the well-known saturation technique for the wide class of oligomorphic structures. Moreover, for the more restrictive homogeneous structures, we are able t...
متن کاملSymbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA processes) where each process manipulates a data structure which can be seen as a nested stack of stacks. Our main result is that, for any higher-order context-free process, the set of all predecessors of a given regula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2008
ISSN: 1860-5974
DOI: 10.2168/lmcs-4(4:14)2008